Algebraically punctured cyclic codes

On shortened and punctured cyclic codes

Abstract. The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the literature that some families of cyclic codes such as BCH codes and Reed-Solomon codes are asymptotically bad, however in general the answer to this question is not known. A recent result by Nelson and Van Zwam sh...

Two-Weight Codes Punctured from Irreducible Cyclic Codes

Interleavers for Punctured Turbo Codes

Puncturing is a way of increasing the code rate by deleting one or more parity bits in a code word without an increase in complexity. Puncturing is applied to the Turbo code scheme of Berrou et al. to increase the coding rate from 1/3 to 1/2 or higher rates. Normally, puncturing causes uneven protection due to the process of random interleav-ing. This problem can be solved with a mod-k in-terle...

Minimality for punctured convolutional codes

AhtracrThis paper investigates encoders optimization for Hamming weight after periodic puncturing, rind discusses minimality issues that may affect the performanoe of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be Catastrophic. A code search can us...

P2 Codes: Pragmatic Trellis Codes Utilizing Punctured Convolutional Codes

In a paper [ I ] , a pragmatic approach to the design of trellis codes was described whereby the basic engine of the trellis decoder was a Viterbi Decoder for the de facto industry and government standard, rate 1/2, 64state, convolutional code. In that paper, codes for 8PSK and 16-PSK modulation were described which performed almost as well as the best trellis codes of comparable complexity (fo...